Descriptive chromatic numbers of locally finite and everywhere two-ended graphs
نویسندگان
چکیده
We construct Borel graphs which settle several questions in descriptive graph combinatorics. These include “Can the Baire measurable chromatic number of a locally finite exceed usual by more than one?” and marked groups with isomorphic Cayley have numbers for their shift differ also provide new bound whose connected components all two ends.
منابع مشابه
On locally finite transitive two - ended digraphs *
Since decades transitive graphs are a topic of great interest. The study of s-edge transitive (undirected) graphs goes back to Tutte [13], who showed that finite cubic graphs cannot be s-edge transitive for s> 5. Weiss [14] proved several years later that the only finite connected s-edge transitive graphs with s = 8 are the cycles. Considering directed graphs the situation is much more involved...
متن کاملA Bound on Measurable Chromatic Numbers of Locally Finite Borel Graphs
We show that the Baire measurable chromatic number of every locally finite Borel graph on a non-empty Polish space is strictly less than twice its ordinary chromatic number, provided this ordinary chromatic number is finite. In the special case that the connectedness equivalence relation is hyperfinite, we obtain the analogous result for the μ-measurable chromatic number.
متن کاملGraphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers
Karger, Motwani and Sudan (JACM 1998) introduced the notion of a vector coloring of a graph. In particular they show that every k-colorable graph is also vector kcolorable, and that for constant k, graphs that are vector kcolorable can be colored by roughly 1 2=k colors. Here is the maximum degree in the graph. Their results play a major role in the best approximation algorithms for coloring an...
متن کاملchromatic and clique numbers of a class of perfect graphs
let $p$ be a prime number and $n$ be a positive integer. the graph $g_p(n)$ is a graph with vertex set $[n]={1,2,ldots ,n}$, in which there is an arc from $u$ to $v$ if and only if $uneq v$ and $pnmid u+v$. in this paper it is shown that $g_p(n)$ is a perfect graph. in addition, an explicit formula for the chromatic number of such graph is given.
متن کاملBraodcast Chromatic Numbers of Graphs
A function π : V → {1, . . . , k} is a broadcast coloring of order k if π(u) = π(v) implies that the distance between u and v is more than π(u). The minimum order of a broadcast coloring is called the broadcast chromatic number of G, and is denoted χb(G). In this paper we introduce this coloring and study its properties. In particular, we explore the relationship with the vertex cover and chrom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups, Geometry, and Dynamics
سال: 2022
ISSN: ['1661-7207', '1661-7215']
DOI: https://doi.org/10.4171/ggd/643